Distributed consensus in wireless network

Connected autonomous systems, which are powered by the synergistic integration of the Internet of Things (IoT), Artificial Intelligence (AI), and 5G technologies, predominantly rely on a central node for making mission-critical decisions. This reliance poses a significant challenge that the condition and capability of the central node largely determine the reliability and effectiveness of decision-making. Maintaining such a centralized system, especially in large-scale wireless networks, can be prohibitively expensive and encounters scalability challenges. In light of these limitations, there’s a compelling need for innovative methods to address the increasing demands of reliability and latency, especially in mission-critical networks where cooperative decision-making is paramount. One promising avenue lies in the distributed consensus protocol, a mechanism intrinsic to distributed computing systems. These protocols offer enhanced robustness, ensuring continued functionality and responsiveness in decision-making even in the face of potential node or communication failures. This thesis pivots on the idea of leveraging distributed consensus to bolster the reliability of mission-critical decision-making within wireless networks, which delves deep into the performance characteristics of wireless distributed consensus, analyzing and subsequently optimizing its attributes, specifically focusing on reliability and latency. The research begins with a fundamental model of consensus reliability in an crash fault tolerance protocol Raft. A novel metric termed ReliabilityGain is introduced to analyze the performance of distributed consensus in wireless network. This innovative concept elucidates the linear correlation between the reliability inherent to consensus-driven decision-making and the reliability of communication link transmission. An intriguing discovery made in my study is the inherent trade-off between the time latency of achieving consensus and its reliability. These two variables appear to be in contradiction, which brings further performance optimization issues. The performance of the Crash and Byzantine fault tolerance protocol is scrutinized and they are compared with original centralized consensus. This exploration becomes particularly pertinent when communication failures occur in wireless distributed consensus. The analytical results are juxtaposed with performance metrics derived from a centralized consensus mechanism. This comparative analysis illuminates the relative merits and demerits of these consensus strategies, evaluated from the dual perspectives of comprehensive consensus reliability and communication latency. In light of the insights gained from the detailed analysis of the Raft and Hotstuff BFT protocols, my thesis further ventures into the realm of optimization strategies for wireless distributed consensus. A central facet of this exploration is the introduction of a tailored communication resource allocation scheme. This scheme, rooted in maximizing the performance of consensus mechanisms, dynamically assesses the network conditions and allocates communication resources such as transmit power and bandwidth to ensure efficient and timely decision-making, which ensures that even in varied and unpredictable network conditions, consensus can be achieved with minimized latency and maximized reliability. The research introduces an adaptive protocol of distributed consensus in wireless network. This proposed adaptive protocol’s strength lies in its ability to autonomously construct consensus-enabled network even if node failures or communication disruptions occur, which ensures that the network’s decision-making process remains uninterrupted and efficient, irrespective of external challenges. The sharding mechanism, which is regarded as an effective solution to scalability issues in distributed system, does not only aid in managing vast networks more efficiently but also ensure that any disruption in one shard cannot compromise the functionality of the entire network. Therefore, this thesis shows the reliability and security analysis of sharding that implemented in wireless distributed system. In essence, these intertwined strategies, rooted in the intricate dance of communication resource allocation, adaptability, and sharding, together form the bedrock of my contributions to enhancing the performance of wireless distributed consensus

Low reliable and low latency communications for mission critical distributed industrial Internet of Things

Achieving ubiquitous ultra-reliable low latency consensus in centralized wireless communication systems can be costly and hard to scale up. The consensus mechanism, which has been widely utilized in distributed systems, can provide fault tolerance to the critical consensus, even though the individual communication link reliability is relatively low. In this paper, a widely used consensus mechanism, Raft, is introduced to the Industrial Internet of Things (IIoT) to achieve ultra-reliable and low latency consensus, where the consensus reliability performance in terms of nodes number and link transmission reliability is investigated. We propose a new concept, Reliability Gain, to show the linear relationship between consensus reliability and communication link transmission reliability. We also find that the time latency of consensus is contradictory to consensus reliability. These conclusions can provide guides to deploy Raft protocol in distributed IIoT systems

Quantum Neuronal Sensing of Quantum Many-Body States on a 61-Qubit Programmable Superconducting Processor

Classifying many-body quantum states with distinct properties and phases of matter is one of the most fundamental tasks in quantum many-body physics. However, due to the exponential complexity that emerges from the enormous numbers of interacting particles, classifying large-scale quantum states has been extremely challenging for classical approaches. Here, we propose a new approach called quantum neuronal sensing. Utilizing a 61 qubit superconducting quantum processor, we show that our scheme can efficiently classify two different types of many-body phenomena: namely the ergodic and localized phases of matter. Our quantum neuronal sensing process allows us to extract the necessary information coming from the statistical characteristics of the eigenspectrum to distinguish these phases of matter by measuring only one qubit. Our work demonstrates the feasibility and scalability of quantum neuronal sensing for near-term quantum processors and opens new avenues for exploring quantum many-body phenomena in larger-scale systems.Comment: 7 pages, 3 figures in the main text, and 13 pages, 13 figures, and 1 table in supplementary material

Experimental quantum computational chemistry with optimised unitary coupled cluster ansatz

Simulation of quantum chemistry is one of the most promising applications of quantum computing. While recent experimental works have demonstrated the potential of solving electronic structures with variational quantum eigensolver (VQE), the implementations are either restricted to nonscalable (hardware efficient) or classically simulable (Hartree-Fock) ansatz, or limited to a few qubits with large errors for the more accurate unitary coupled cluster (UCC) ansatz. Here, integrating experimental and theoretical advancements of improved operations and dedicated algorithm optimisations, we demonstrate an implementation of VQE with UCC for H_2, LiH, F_2 from 4 to 12 qubits. Combining error mitigation, we produce high-precision results of the ground-state energy with error suppression by around two orders of magnitude. For the first time, we achieve chemical accuracy for H_2 at all bond distances and LiH at small bond distances in the experiment. Our work demonstrates a feasible path towards a scalable solution to electronic structure calculation, validating the key technological features and identifying future challenges for this goal.Comment: 8 pages, 4 figures in the main text, and 29 pages supplementary materials with 16 figure

DNA-Based Biosensors for the Biochemical Analysis: A Review

In recent years, DNA-based biosensors have shown great potential as the candidate of the next generation biomedical detection device due to their robust chemical properties and customizable biosensing functions. Compared with the conventional biosensors, the DNA-based biosensors have advantages such as wider detection targets, more durable lifetime, and lower production cost. Additionally, the ingenious DNA structures can control the signal conduction near the biosensor surface, which could significantly improve the performance of biosensors. In order to show a big picture of the DNA biosensor’s advantages, this article reviews the background knowledge and recent advances of DNA-based biosensors, including the functional DNA strands-based biosensors, DNA hybridization-based biosensors, and DNA templated biosensors. Then, the challenges and future directions of DNA-based biosensors are discussed and proposed

Security Analysis of Sharding in the Blockchain System

The design of sharding aims to solve the scalability challenge in a blockchain network. Typically, by splitting the whole blockchain network into smaller shards, the transaction throughput can be significantly improved. However, distributing fewer attesting nodes for transactions in a shard may cause higher security risks. This paper analyzes the security level of transaction verification in different types of shards and transactions. The analyzed result indicates that the size of shards and validating nodes number may influence the transaction security in shards. And the random distribution of attesting nodes can reduce such influence and improve the reliability of consensus in shards

Adaptive protocol of raft in wireless network

Original distributed consensus algorithms are typically engineered with wired communication networks in mind. However, when these algorithms are applied in wireless networks, the unique characteristics of wireless communication among nodes, including high error rates, variable latency, and dynamic network topology, present novel challenges that necessitate the development of adaptive protocols. This article aims to address these challenges by designing an adaptive protocol specifically for the implementation of the Raft consensus algorithm within wireless environments. We first outline the key stages of this adaptive protocol, focusing on enhancing robustness and efficiency in the state synchronization and routing processes, which are demonstrated through extensive simulations. The proposed adaptive protocol intends to ensure consistent states across nodes in wireless networks, which promote reliable and effective distributed systems for a variety of applications in autonomous wireless networks, including Vehicle-to-everything (V2X), Internet of Things (IoT), and edge computing